Convex Hull Asymptotic Shape Evolution
نویسندگان
چکیده
The asymptotic properties of Rapidly exploring Random Tree (RRT) growth in large spaces is studied both in simulation and analysis. The main phenomenon is that the convex hull of the RRT reliably evolves into an equilateral triangle when grown in a symmetric planar region (a disk). To characterize this and related phenomena from flocking and swarming, a family of dynamical systems based on incremental evolution in the space of shapes is introduced. Basins of attraction over the shape space explain why the number of hull vertices tends to reduce and the shape stabilizes to a regular polygon with no more than four vertices.
منابع مشابه
Asymptotic Geometry of Non-mixing Sequences
The exact order of mixing for zero-dimensional algebraic dynamical systems is not entirely understood. Here non-Archimedean norms in function fields of positive characteristic are used to exhibit an asymptotic shape in non-mixing sequences for algebraic Z-actions. This gives a relationship between the order of mixing and the convex hull of the defining polynomial. Using these methods, we show t...
متن کاملAlpha-Concave Hull, a Generalization of Convex Hull
Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they construct non-convex enclosure on a set of points. In this paper, we introduce another generalization of convex hull, named alpha-concave hull, and compare ...
متن کاملPartial shape matching using convex hull and Fourier descriptors
An application of Fourier descriptors and convex hull for shape analysis is presented. Convex hull is used for dividing a shape into small parts. Amplitude spectrum which is invariant to scaling, translation and choosing a starting point is obtained from the Fourier descriptors (see e.g [1-3]) and used for comparison. All calculations are performed with the author's software and some algorithms...
متن کاملAsymptotic mean values of Gaussian polytopes
We consider geometric functionals of the convex hull of normally distributed random points in Euclidean space R. In particular, we determine the asymptotic behaviour of the expected value of such functionals and of related geometric probabilities, as the number of points increases.
متن کاملDynamic Planar Convex Hull
In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(logn) time per operation. The space usage of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangen...
متن کامل